Computational problem - PDFSEARCH.IO - Document Search Engine

Computational problem
Results: 1172

#	Item
331	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Privacy by Fake Data: A Geometric Approach Victor Alvarez∗ Erin Chambers† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:56 Complexity classes Structural complexity theory Mathematical optimization Approximation algorithms Ε-net NP Polynomial-time approximation scheme Reduction Packing problem Theoretical computer science Computational complexity theory Applied mathematics
332	Computational Bifurcation and Stability Studies of the 8:1 Thermal Cavity Problem Andrew G. Salinger1, Richard B. Lehoucq2, Roger P. Pawlowski1, John N. Shadid1 Keywords: Bifurcations, Stability, Eigenvalues, Parallel Co Add to Reading List Source URL: www.cs.sandia.gov Language: English - Date: 2002-06-14 18:33:06 Numerical linear algebra Abstract algebra Numerical analysis Bifurcation theory Eigenvalue algorithm Partial differential equation Preconditioner Matrix Eigenvalues and eigenvectors Algebra Mathematics Linear algebra
333	Exploiting symmetries in logistics distribution planning Add to Reading List Source URL: www.mssanz.org.au Language: English - Date: 2013-01-15 22:34:44 NP-complete problems Analysis of algorithms Algorithm Mathematical logic Travelling salesman problem Logistics Symmetry in mathematics Time complexity Vehicle routing problem Theoretical computer science Computational complexity theory Applied mathematics
334	CCCG 2004, Montreal, Quebec, August 9–11, 2004 Separating points by axis-parallel lines Gruia C˘alinescu Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-08-23 15:27:23 Complexity classes NP-complete problems Combinatorial optimization Operations research Computational problems Linear programming relaxation APX NP-complete Boolean satisfiability problem Theoretical computer science Computational complexity theory Mathematics
335	CCCG 2011, Toronto ON, August 10–12, 2011 Space-efficient Algorithms for Empty Space Recognition among a Point Set in 2D and 3D Minati De∗† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Largest empty rectangle Algorithm Closest pair of points problem Reduction Computer science Computational geometry Beta skeleton Mathematics Applied mathematics Computational complexity theory
336	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Generalized Watchman Route Problem with Discrete View Cost Pengpeng Wang∗, Ramesh Krishnamurti †, Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:28:40 Computational geometry Simple polygon Travelling salesman problem Mathematics Applied mathematics Art gallery problem
337	On the Theory of Average Case Complexity Shai Ben-Davidy Benny Chor Oded Goldreichz Michael Lubyx Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2014-06-22 06:24:22 Complexity classes Computability theory Mathematical optimization Structural complexity theory P versus NP problem NP-complete Turing reduction Decision problem Reduction Theoretical computer science Computational complexity theory Applied mathematics
338	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Approximating k-hop Minimum Spanning Trees in Euclidean Metrics∗ S¨oren Laue† Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:25:19 Operations research Spanning tree Complexity classes NP-complete problems Minimum spanning tree Steiner tree problem R-tree Approximation algorithm Facility location Theoretical computer science Computational complexity theory Applied mathematics
339	On Problems as Hard as CNF-SAT∗ Marek Cygan† Holger Dell‡ Jesper Nederlofk Add to Reading List Source URL: arxiv.org Language: English - Date: 2014-03-27 21:09:14 NP-complete problems Exponential time hypothesis Conjunctive normal form Boolean satisfiability problem Vertex cover Set cover problem Time complexity Graph coloring Independent set Theoretical computer science Computational complexity theory Applied mathematics
340	A Theory and Algorithms for Combinatorial Reoptimization? Hadas Shachnai1?? , Gal Tamir1 , and Tami Tamir2 1 2 Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2012-02-29 12:43:33 Operations research Complexity classes NP-complete problems Approximation algorithm Optimization problem Reduction NP Knapsack problem Dynamic programming Theoretical computer science Applied mathematics Computational complexity theory

UPDATE